ISCB Ebola Award for Important Future Research on the Computational Biology of Ebola Virus

Speed is of the essence in combating Ebola; thus, computational approaches should form a significant component of Ebola research. As for the development of any modern drug, computational biology is uniquely positioned to contribute through comparative analysis of the genome sequences of Ebola strains as well as 3-D protein modeling. Other computational approaches to Ebola may include large-scale docking studies of Ebola proteins with human proteins and with small-molecule libraries, computational modeling of the spread of the virus, computational mining of the Ebola literature, and creation of a curated Ebola database. Taken together, such computational efforts could significantly accelerate traditional scientific approaches. In recognition of the need for important and immediate solutions from the field of computational biology against Ebola, the International Society for Computational Biology (ISCB) announces a prize for an important computational advance in fighting the Ebola virus. ISCB will confer the ISCB Fight against Ebola Award, along with a prize of US$2,000, at its July 2016 annual meeting (ISCB Intelligent Systems for Molecular Biology [ISMB] 2016, Orlando, Florida)

Automatic Planning and Control of Robot Natural Motion Via Feedback

A feedback control strategy for the command of robot motion includes some limited automatic planning capabilities. These may be seen as sequential solution algorithms implemented by the robot arm interpreted as a mechanical analog computer. This perspective lends additional insight into the manner in which such control techniques may fail, and motivates a fresh look at requisite sensory capabilities. For more information: Kod*La

Fr-TM-align: a new protein structural alignment method based on fragment alignments and the TM-score

©2008 Pandit and Skolnick; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article is available from: http://www.biomedcentral.com/1471-2105/9/531doi:10.1186/1471-2105-9-531Background: Protein tertiary structure comparisons are employed in various fields of contemporary structural biology. Most structure comparison methods involve generation of an initial seed alignment, which is extended and/or refined to provide the best structural superposition between a pair of protein structures as assessed by a structure comparison metric. One such metric, the TM-score, was recently introduced to provide a combined structure quality measure of the coordinate root mean square deviation between a pair of structures and coverage. Using the TM-score, the TM-align structure alignment algorithm was developed that was often found to have better accuracy and coverage than the most commonly used structural alignment programs; however, there were a number of situations when this was not true. Results: To further improve structure alignment quality, the Fr-TM-align algorithm has been developed where aligned fragment pairs are used to generate the initial seed alignments that are then refined using dynamic programming to maximize the TM-score. For the assessment of the structural alignment quality from Fr-TM-align in comparison to other programs such as CE and TMalign, we examined various alignment quality assessment scores such as PSI and TM-score. The assessment showed that the structural alignment quality from Fr-TM-align is better in comparison to both CE and TM-align. On average, the structural alignments generated using Fr-TM-align have a higher TM-score (~9%) and coverage (~7%) in comparison to those generated by TM-align. Fr- TM-align uses an exhaustive procedure to generate initial seed alignments. Hence, the algorithm is computationally more expensive than TM-align. Conclusion: Fr-TM-align, a new algorithm that employs fragment alignment and assembly provides better structural alignments in comparison to TM-align. The source code and executables of Fr- TM-align are freely downloadable at: http://cssb.biology.gatech.edu/skolnick/files/FrTMalign/

Wall roughness induces asymptotic ultimate turbulence

Turbulence is omnipresent in Nature and technology, governing the transport of heat, mass, and momentum on multiple scales. For real-world applications of wall-bounded turbulence, the underlying surfaces are virtually always rough; yet characterizing and understanding the effects of wall roughness for turbulence remains a challenge, especially for rotating and thermally driven turbulence. By combining extensive experiments and numerical simulations, here, taking as example the paradigmatic Taylor-Couette system (the closed flow between two independently rotating coaxial cylinders), we show how wall roughness greatly enhances the overall transport properties and the corresponding scaling exponents. If only one of the walls is rough, we reveal that the bulk velocity is slaved to the rough side, due to the much stronger coupling to that wall by the detaching flow structures. If both walls are rough, the viscosity dependence is thoroughly eliminated in the boundary layers and we thus achieve asymptotic ultimate turbulence, i.e. the upper limit of transport, whose existence had been predicted by Robert Kraichnan in 1962 (Phys. Fluids {\bf 5}, 1374 (1962)) and in which the scalings laws can be extrapolated to arbitrarily large Reynolds numbers

Linear-time protein 3-D structure searching with insertions and deletions

<p>Abstract</p> <p>Background</p> <p>Two biomolecular 3-D structures are said to be similar if the RMSD (root mean square deviation) between the two molecules' sequences of 3-D coordinates is less than or equal to some given constant bound. Tools for searching for similar structures in biomolecular 3-D structure databases are becoming increasingly important in the structural biology of the post-genomic era.</p> <p>Results</p> <p>We consider an important, fundamental problem of reporting all substructures in a 3-D structure database of chain molecules (such as proteins) which are similar to a given query 3-D structure, with consideration of indels (<it>i.e.</it>, insertions and deletions). This problem has been believed to be very difficult but its exact computational complexity has not been known. In this paper, we first prove that the problem in unbounded dimensions is NP-hard. We then propose a new algorithm that dramatically improves the average-case time complexity of the problem in 3-D in case the number of indels <it>k </it>is bounded by a constant. Our algorithm solves the above problem for a query of size <it>m </it>and a database of size <it>N </it>in average-case <it>O</it>(<it>N</it>) time, whereas the time complexity of the previously best algorithm was <it>O</it>(<it>Nm</it>^<it>k</it>+1).</p> <p>Conclusions</p> <p>Our results show that although the problem of searching for similar structures in a database based on the RMSD measure with indels is NP-hard in the case of unbounded dimensions, it can be solved in 3-D by a simple average-case linear time algorithm when the number of indels is bounded by a constant.</p

The methodology for developing a prospective meta-analysis in the family planning community

<p>Abstract</p> <p>Background</p> <p>Prospective meta-analysis (PMA) is a collaborative research design in which individual sites perform randomized controlled trials (RCTs) and pool the data for meta-analysis. Members of the PMA collaboration agree upon specific research interventions and outcome measures, ideally before initiation but at least prior to any individual trial publishing results. This allows for uniform reporting of primary and secondary outcomes. With this approach, heterogeneity among trials contributing data for the final meta-analysis is minimized while each site maintains the freedom to design a specific trial. This paper describes the process of creating a PMA collaboration to evaluate the impact of misoprostol on ease of intrauterine device (IUD) insertion in nulliparous women.</p> <p>Methods</p> <p>After the principal investigator developed a preliminary PMA protocol, he identified potential collaborating investigators at other sites. One site already had a trial underway and another site was in the planning stages of a trial meeting PMA requirements. Investigators at six sites joined the PMA collaborative. Each site committed to enroll subjects to meet a pre-determined total sample size. A final common research plan and site responsibilities were developed and agreed upon through email and face-to-face meetings. Each site committed to contribute individual patient data to the PMA collaboration, and these data will be analyzed and prepared as a multi-site publication. Individual sites retain the ability to analyze and publish their site's independent findings.</p> <p>Results</p> <p>All six sites have obtained Institutional Review Board approval and each has obtained individual funding to meet the needs of that site's study. Sites have shared resources including study protocols and consents to decrease costs and improve study flow. This PMA protocol is registered with the Cochrane Collaboration and data will be analyzed according to Cochrane standards for meta-analysis.</p> <p>Conclusions</p> <p>PMA is a novel research method that improves meta-analysis by including several study sites, establishing uniform reporting of specific outcomes, and yet allowing some independence on the part of individual sites with respect to the conduct of research. The inclusion of several sites increases statistical power to address important clinical questions. Compared to multi-center trials, PMA methodology encourages collaboration, aids in the development of new investigators, decreases study costs, and decreases time to publication.</p> <p>Trial Registration</p> <p>ClinicalTrials.gov: <a href="http://www.clinicaltrials.gov/ct2/show/NCT00613366">NCT00613366</a>, <a href="http://www.clinicaltrials.gov/ct2/show/NCT00886834">NCT00886834</a>, <a href="http://www.clinicaltrials.gov/ct2/show/NCT01001897">NCT01001897</a>, <a href="http://www.clinicaltrials.gov/ct2/show/NCT01147497">NCT01147497</a> and <a href="http://www.clinicaltrials.gov/ct2/show/NCT01307111">NCT01307111</a></p

TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model

<p>Abstract</p> <p>Background</p> <p>Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have managed to capture the intuitive understanding of protein structures developed in structural biology, especially in the context of rapid database searches. Such intuitions could help speed up similarity searches and make it easier to understand the results of such analyses.</p> <p>Results</p> <p>We developed a TOPS++FATCAT algorithm that uses an intuitive description of the proteins' structures as captured in the popular TOPS diagrams to limit the search space of the aligned fragment pairs (AFPs) in the flexible alignment of protein structures performed by the FATCAT algorithm. The TOPS++FATCAT algorithm is faster than FATCAT by more than an order of magnitude with a minimal cost in classification and alignment accuracy. For beta-rich proteins its accuracy is better than FATCAT, because the TOPS+ strings models contains important information of the parallel and anti-parallel hydrogen-bond patterns between the beta-strand SSEs (Secondary Structural Elements). We show that the TOPS++FATCAT errors, rare as they are, can be clearly linked to oversimplifications of the TOPS diagrams and can be corrected by the development of more precise secondary structure element definitions.</p> <p>Software Availability</p> <p>The benchmark analysis results and the compressed archive of the TOPS++FATCAT program for Linux platform can be downloaded from the following web site: <url>http://fatcat.burnham.org/TOPS/</url></p> <p>Conclusion</p> <p>TOPS++FATCAT provides FATCAT accuracy and insights into protein structural changes at a speed comparable to sequence alignments, opening up a possibility of interactive protein structure similarity searches.</p

Comparison of Classifier Fusion Methods for Predicting Response to Anti HIV-1 Therapy

BACKGROUND: Analysis of the viral genome for drug resistance mutations is state-of-the-art for guiding treatment selection for human immunodeficiency virus type 1 (HIV-1)-infected patients. These mutations alter the structure of viral target proteins and reduce or in the worst case completely inhibit the effect of antiretroviral compounds while maintaining the ability for effective replication. Modern anti-HIV-1 regimens comprise multiple drugs in order to prevent or at least delay the development of resistance mutations. However, commonly used HIV-1 genotype interpretation systems provide only classifications for single drugs. The EuResist initiative has collected data from about 18,500 patients to train three classifiers for predicting response to combination antiretroviral therapy, given the viral genotype and further information. In this work we compare different classifier fusion methods for combining the individual classifiers. PRINCIPAL FINDINGS: The individual classifiers yielded similar performance, and all the combination approaches considered performed equally well. The gain in performance due to combining methods did not reach statistical significance compared to the single best individual classifier on the complete training set. However, on smaller training set sizes (200 to 1,600 instances compared to 2,700) the combination significantly outperformed the individual classifiers (p<0.01; paired one-sided Wilcoxon test). Together with a consistent reduction of the standard deviation compared to the individual prediction engines this shows a more robust behavior of the combined system. Moreover, using the combined system we were able to identify a class of therapy courses that led to a consistent underestimation (about 0.05 AUC) of the system performance. Discovery of these therapy courses is a further hint for the robustness of the combined system. CONCLUSION: The combined EuResist prediction engine is freely available at http://engine.euresist.org

Using least median of squares for structural superposition of flexible proteins

<p>Abstract</p> <p>Background</p> <p>The conventional superposition methods use an ordinary least squares (LS) fit for structural comparison of two different conformations of the same protein. The main problem of the LS fit that it is sensitive to outliers, i.e. large displacements of the original structures superimposed.</p> <p>Results</p> <p>To overcome this problem, we present a new algorithm to overlap two protein conformations by their atomic coordinates using a robust statistics technique: least median of squares (LMS). In order to effectively approximate the LMS optimization, the forward search technique is utilized. Our algorithm can automatically detect and superimpose the rigid core regions of two conformations with small or large displacements. In contrast, most existing superposition techniques strongly depend on the initial LS estimating for the entire atom sets of proteins. They may fail on structural superposition of two conformations with large displacements. The presented LMS fit can be considered as an alternative and complementary tool for structural superposition.</p> <p>Conclusion</p> <p>The proposed algorithm is robust and does not require any prior knowledge of the flexible regions. Furthermore, we show that the LMS fit can be extended to multiple level superposition between two conformations with several rigid domains. Our fit tool has produced successful superpositions when applied to proteins for which two conformations are known. The binary executable program for Windows platform, tested examples, and database are available from <url>https://engineering.purdue.edu/PRECISE/LMSfit</url>.</p